An algorithm for the verification of timing diagrams realizability
نویسندگان
چکیده
In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying interface is feasible. The method is based on the consistency of the timing constraints derived from the timing diagram and accepts unknown occurrence times for events produced by the environment.
منابع مشابه
Conformance Verification of Normative Specifications using C-O Diagrams
C-O Diagrams have been introduced as a means to have a visual representation of normative texts and electronic contracts, where it is possible to represent the obligations, permissions and prohibitions of the different signatories, as well as what are the penalties in case of not fulfillment of their obligations and prohibitions. In such diagrams we are also able to represent absolute and relat...
متن کاملAutomatic Synthesis and Formal Verification of Interfaces Between Incompatible Soft Intellectual Properties
In this work, we are concerned with automatic synthesis and formal verification of interfaces between incompatible soft intellectual properties (IPs) for System On Chip (SOC) design. IPs Structural and dynamic aspects are modeled via UML2.x diagrams such as structural, timing and Statecharts diagrams. From these diagrams, interfaces are generated automatically between incompatible IPs following...
متن کاملTiming Analysis of UML Activity Diagrams
UML activity diagrams can be used for modeling the dynamic aspects of systems and for constructing executable systems through forward and reverse engineering. They are very suitable for describing the model of program behaviour. In this paper, we extend UML activity diagrams by introducing timing constraints so that they can be used to model real-time software systems, and give the solution for...
متن کاملEfficient Decompositional Model Checking for Regular Timing Diagrams
Timing diagrams are widely used in industrial practice to express precedence and timing relationships amongst a collection of signals. This graphical notation is often more convenient than the use of temporal logic or automata. We introduce a class of timing diagrams called Regular Timing Diagrams (RTD’s). RTD’s have a precise syntax, and a formal semantics that is simple and corresponds to com...
متن کاملModelling and Analysis of Asynchronous Circuits and Timing Diagrams Using Parametric Timed Automata
Many successful model checking methods have been applied to hardware design in real-time applications. In this paper, we apply Parametric Timed Automata (PTA) to model the delays of asynchronous circuits. The PTAs modelling the delays of asynchronous circuits fall into the so-called lower bound and upper bound automata (L/U automata) which are subclasses of general PTAs with a decidable reachab...
متن کامل